Design and Analysis of Algorithms for Similarity Search Based on Intrinsic Dimension
نویسنده
چکیده
DESIGN AND ANALYSIS OF ALGORITHMS FOR SIMILARITY SEARCH BASED ON INTRINSIC DIMENSION
منابع مشابه
An improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملDetermination of Optimal Parameters for Finite Plates with a Quasi-Square Hole
This paper aims at optimizing the parameters involved in stress analysis of perforated plates, in order to achieve the least amount of stress around the square-shaped holes located in a finite isotropic plate using metaheuristic optimization algorithms. Metaheuristics may be classified into three main classes: evolutionary, physics-based, and swarm intelligence algorithms. This research uses Ge...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملAN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کاملRank Cover Trees for Nearest Neighbor Search
Virtually all known distance-based similarity search indexes make use of some form of numerical constraints (triangle inequality, additive distance bounds, . . . ) on similarity values for pruning and selection. The use of such numerical constraints, however, often leads to large variations in the numbers of objects examined in the execution of a query, making it difficult to control the execut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014